Bergman’s centralizer theorem and quantization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized twisted centralizer codes

An important code of length n is obtained by taking centralizer of a square matrix over a finite field Fq. Twisted centralizer codes, twisted by an element a ∈ Fq, are also similar type of codes but different in nature. The main results were embedded on dimension and minimum distance. In this paper, we have defined a new family of twisted centralizer codes namely generalized twisted centralizer...

متن کامل

A Uniqueness Theorem for Constraint Quantization

This work addresses certain ambiguities in the Dirac approach to constrained systems. Specifically, we investigate the space of so-called “rigging maps” associated with Refined Algebraic Quantization, a particular realization of the Dirac scheme. Our main result is to provide a condition under which the rigging map is unique, in which case we also show that it is given by group averaging techni...

متن کامل

On Zador's Entropy-Constrained Quantization Theorem

Zador’s classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorithm used to optimize such quantizers. A proof that the result holds for a general class of distributions is sketched.

متن کامل

Twisted Centralizer Codes

Given an n× n matrix A over a field F and a scalar a ∈ F , we consider the linear codes C(A, a) := {B ∈ F | AB = aBA} of length n2. We call C(A, a) a twisted centralizer code. We investigate properties of these codes including their dimensions, minimum distances, parity-check matrices, syndromes, and automorphism groups. The minimal distance of a centralizer code (when a = 1) is at most n, howe...

متن کامل

Geometric Sampling of Images, Vector Quantization and Zador’s Theorem

We present several consequences of the geometric approach to image sampling and reconstruction we have previously introduced. We single out the relevance of the geometric method to the vector quantization of images and, more important, we give a concrete and candidate for the optimal embedding dimension in Zador’s Thorem. An additional advantage of our approach is that that this provides a cons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Algebra

سال: 2017

ISSN: 0092-7872,1532-4125

DOI: 10.1080/00927872.2017.1372462